Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview
نویسندگان
چکیده
منابع مشابه
Shortest Path Problem under Intuitionistic Fuzzy Setting
Biswas, S. S. , Alam, B. , Doja, M. N. 2013. An algorithm for extracting intuitionistic fuzzy shortest path in a graph. Applied Computational Intelligence and Soft Computing, 17. Dubois, D. and Prade, H. 1980. Fuzzy Sets and Systems: Theory and Applications, Academic Press, New York. De, P. K. and Das, D. 2012 Ranking of trapezoidal intuitionistic fuzzy numbers, Intelligent Systems Design and A...
متن کاملShortest Path Problem on Intuitionistic Fuzzy Network
Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are rep...
متن کاملShortest Path Problem Under Triangular Fuzzy Number Neutrosophic Information
In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed appr...
متن کاملA New Algorithm for Solving Fuzzy Constrained Shortest Path Problem using Intuitionistic Fuzzy Numbers
Constrained shortest path problem (CSPP) is an NPComplete problem where the goal is to determine the cheapest path bounded by a given delay constraint. This problem finds application in several fields like television and transportation networks, ATM circuit routing, multimedia applications etc. In these kinds of applications it is important to provide quality of service (QoS). Therefore, it is ...
متن کاملFuzzy Dijkstra algorithm for shortest path problem under uncertain environment
A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2019
ISSN: 2199-4536,2198-6053
DOI: 10.1007/s40747-019-0098-z